منابع مشابه
Fully bordered words
Any primitive binary word contains at least two unbordered conjugates. We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes. In this paper we relate two elementary properties of finite words: being a palin-drome and being unbordered. These two concepts are in a sense complementary. Unbordered words have maxi...
متن کاملInvolutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each...
متن کاملPseudo-Identities and Bordered Words
This paper investigates the notions of θ-bordered words and θ-unbordered words for various pseudo-identity functions θ. A θ-bordered word is a non-empty word u such that there exists a word v which is a prefix of u while θ(v) is a suffix of u. The case where θ is the identity function corresponds to the classical notions of bordered and unbordered words. Here we explore cases where θ is a pseud...
متن کاملCounting Bordered Partial Words by Critical Positions
A partial word, sequence over a finite alphabet that may have some undefined positions or holes, is bordered if one of its proper prefixes is compatible with one of its suffixes. The number theoretical problem of enumerating all bordered full words (the ones without holes) of a fixed length n over an alphabet of a fixed size k is well known. In this paper, we investigate the number of bordered ...
متن کاملOn pseudoknot-bordered words and their properties
a r t i c l e i n f o a b s t r a c t We study a generalization of the classical notions of bordered and unbordered words, motivated by biomolecular computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in biomolecular computing to encode information. Due to the fact that A is Watson–Crick complementary to T and G to C, DNA single strands that are W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.10.020